TSTP Solution File: ITP090^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP090^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 08:06:55 EDT 2024

% Result   : Theorem 0.39s 0.67s
% Output   : CNFRefutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   29 (  11 unt;  14 typ;   0 def)
%            Number of atoms       :   25 (   2 equ;   0 cnn)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :   90 (  10   ~;   7   |;   2   &;  70   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :    7 (   0   ^   7   !;   0   ?;   7   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    secrecy_specID: $tType ).

thf(decl_sort2,type,
    set_Secrecy_KS: $tType ).

thf(decl_sort3,type,
    secrecy_KS: $tType ).

thf(decl_sort4,type,
    secrecy_Expression: $tType ).

thf(decl_sort5,type,
    secrecy_Keys: $tType ).

thf(decl_22,type,
    localSecrets: secrecy_specID > set_Secrecy_KS ).

thf(decl_24,type,
    knowle945212990e_know: secrecy_specID > secrecy_KS > $o ).

thf(decl_52,type,
    ine: secrecy_specID > secrecy_Expression > $o ).

thf(decl_62,type,
    secrecy_kE: secrecy_Keys > secrecy_Expression ).

thf(decl_65,type,
    secrecy_kKS: secrecy_Keys > secrecy_KS ).

thf(decl_96,type,
    member_Secrecy_KS: secrecy_KS > set_Secrecy_KS > $o ).

thf(decl_103,type,
    q: secrecy_specID ).

thf(decl_104,type,
    key: secrecy_Keys ).

thf(decl_105,type,
    m: secrecy_KS ).

thf(fact_8_know_Osimps_I1_J,axiom,
    ! [X3: secrecy_specID,X4: secrecy_Keys] :
      ( ( knowle945212990e_know @ X3 @ ( secrecy_kKS @ X4 ) )
    <=> ( ( ine @ X3 @ ( secrecy_kE @ X4 ) )
        | ( member_Secrecy_KS @ ( secrecy_kKS @ X4 ) @ ( localSecrets @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.DEo6kTHnAY/E---3.1_9203.p',fact_8_know_Osimps_I1_J) ).

thf(conj_0,conjecture,
    ~ ( member_Secrecy_KS @ ( secrecy_kKS @ key ) @ ( localSecrets @ q ) ),
    file('/export/starexec/sandbox/tmp/tmp.DEo6kTHnAY/E---3.1_9203.p',conj_0) ).

thf(fact_0_not__knowQm,axiom,
    ~ ( knowle945212990e_know @ q @ m ),
    file('/export/starexec/sandbox/tmp/tmp.DEo6kTHnAY/E---3.1_9203.p',fact_0_not__knowQm) ).

thf(fact_1_a1,axiom,
    ( m
    = ( secrecy_kKS @ key ) ),
    file('/export/starexec/sandbox/tmp/tmp.DEo6kTHnAY/E---3.1_9203.p',fact_1_a1) ).

thf(c_0_4,plain,
    ! [X1166: secrecy_specID,X1167: secrecy_Keys] :
      ( ( ~ ( knowle945212990e_know @ X1166 @ ( secrecy_kKS @ X1167 ) )
        | ( ine @ X1166 @ ( secrecy_kE @ X1167 ) )
        | ( member_Secrecy_KS @ ( secrecy_kKS @ X1167 ) @ ( localSecrets @ X1166 ) ) )
      & ( ~ ( ine @ X1166 @ ( secrecy_kE @ X1167 ) )
        | ( knowle945212990e_know @ X1166 @ ( secrecy_kKS @ X1167 ) ) )
      & ( ~ ( member_Secrecy_KS @ ( secrecy_kKS @ X1167 ) @ ( localSecrets @ X1166 ) )
        | ( knowle945212990e_know @ X1166 @ ( secrecy_kKS @ X1167 ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_know_Osimps_I1_J])])])]) ).

thf(c_0_5,negated_conjecture,
    member_Secrecy_KS @ ( secrecy_kKS @ key ) @ ( localSecrets @ q ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_6,plain,
    ~ ( knowle945212990e_know @ q @ m ),
    inference(fof_simplification,[status(thm)],[fact_0_not__knowQm]) ).

thf(c_0_7,plain,
    ! [X1: secrecy_Keys,X3: secrecy_specID] :
      ( ( knowle945212990e_know @ X3 @ ( secrecy_kKS @ X1 ) )
      | ~ ( member_Secrecy_KS @ ( secrecy_kKS @ X1 ) @ ( localSecrets @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_8,plain,
    ( m
    = ( secrecy_kKS @ key ) ),
    inference(split_conjunct,[status(thm)],[fact_1_a1]) ).

thf(c_0_9,negated_conjecture,
    member_Secrecy_KS @ ( secrecy_kKS @ key ) @ ( localSecrets @ q ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_10,plain,
    ~ ( knowle945212990e_know @ q @ m ),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

thf(c_0_11,plain,
    ! [X3: secrecy_specID] :
      ( ( knowle945212990e_know @ X3 @ m )
      | ~ ( member_Secrecy_KS @ m @ ( localSecrets @ X3 ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_12,negated_conjecture,
    member_Secrecy_KS @ m @ ( localSecrets @ q ),
    inference(rw,[status(thm)],[c_0_9,c_0_8]) ).

thf(c_0_13,plain,
    ~ ( knowle945212990e_know @ q @ m ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.19  % Problem    : ITP090^1 : TPTP v8.1.2. Released v7.5.0.
% 0.11/0.20  % Command    : run_E %s %d THM
% 0.17/0.39  % Computer : n002.cluster.edu
% 0.17/0.39  % Model    : x86_64 x86_64
% 0.17/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.39  % Memory   : 8042.1875MB
% 0.17/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.40  % CPULimit   : 300
% 0.17/0.40  % WCLimit    : 300
% 0.17/0.40  % DateTime   : Fri May  3 12:46:57 EDT 2024
% 0.17/0.40  % CPUTime    : 
% 0.36/0.57  Running higher-order theorem proving
% 0.36/0.57  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.DEo6kTHnAY/E---3.1_9203.p
% 0.39/0.67  # Version: 3.1.0-ho
% 0.39/0.67  # Preprocessing class: HSLSSMSMSSMNSFA.
% 0.39/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.67  # Starting new_ho_3 with 1500s (5) cores
% 0.39/0.67  # Starting pre_casc_2 with 300s (1) cores
% 0.39/0.67  # Starting additional_ho_7 with 300s (1) cores
% 0.39/0.67  # Starting lpo8_s with 300s (1) cores
% 0.39/0.67  # additional_ho_7 with pid 9283 completed with status 0
% 0.39/0.67  # Result found by additional_ho_7
% 0.39/0.67  # Preprocessing class: HSLSSMSMSSMNSFA.
% 0.39/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.67  # Starting new_ho_3 with 1500s (5) cores
% 0.39/0.67  # Starting pre_casc_2 with 300s (1) cores
% 0.39/0.67  # Starting additional_ho_7 with 300s (1) cores
% 0.39/0.67  # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.39/0.67  # Search class: HGHSM-FSLM32-SSFFFFBN
% 0.39/0.67  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.67  # Starting new_bool_3 with 163s (1) cores
% 0.39/0.67  # new_bool_3 with pid 9286 completed with status 0
% 0.39/0.67  # Result found by new_bool_3
% 0.39/0.67  # Preprocessing class: HSLSSMSMSSMNSFA.
% 0.39/0.67  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.67  # Starting new_ho_3 with 1500s (5) cores
% 0.39/0.67  # Starting pre_casc_2 with 300s (1) cores
% 0.39/0.67  # Starting additional_ho_7 with 300s (1) cores
% 0.39/0.67  # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.39/0.67  # Search class: HGHSM-FSLM32-SSFFFFBN
% 0.39/0.67  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.67  # Starting new_bool_3 with 163s (1) cores
% 0.39/0.67  # Preprocessing time       : 0.009 s
% 0.39/0.67  # Presaturation interreduction done
% 0.39/0.67  
% 0.39/0.67  # Proof found!
% 0.39/0.67  # SZS status Theorem
% 0.39/0.67  # SZS output start CNFRefutation
% See solution above
% 0.39/0.67  # Parsed axioms                        : 453
% 0.39/0.67  # Removed by relevancy pruning/SinE    : 259
% 0.39/0.67  # Initial clauses                      : 389
% 0.39/0.67  # Removed in clause preprocessing      : 18
% 0.39/0.67  # Initial clauses in saturation        : 371
% 0.39/0.67  # Processed clauses                    : 444
% 0.39/0.67  # ...of these trivial                  : 2
% 0.39/0.67  # ...subsumed                          : 84
% 0.39/0.67  # ...remaining for further processing  : 358
% 0.39/0.67  # Other redundant clauses eliminated   : 56
% 0.39/0.67  # Clauses deleted for lack of memory   : 0
% 0.39/0.67  # Backward-subsumed                    : 8
% 0.39/0.67  # Backward-rewritten                   : 4
% 0.39/0.67  # Generated clauses                    : 65
% 0.39/0.67  # ...of the previous two non-redundant : 39
% 0.39/0.67  # ...aggressively subsumed             : 0
% 0.39/0.67  # Contextual simplify-reflections      : 16
% 0.39/0.67  # Paramodulations                      : 19
% 0.39/0.67  # Factorizations                       : 0
% 0.39/0.67  # NegExts                              : 0
% 0.39/0.67  # Equation resolutions                 : 60
% 0.39/0.67  # Disequality decompositions           : 0
% 0.39/0.67  # Total rewrite steps                  : 25
% 0.39/0.67  # ...of those cached                   : 10
% 0.39/0.67  # Propositional unsat checks           : 0
% 0.39/0.67  #    Propositional check models        : 0
% 0.39/0.67  #    Propositional check unsatisfiable : 0
% 0.39/0.67  #    Propositional clauses             : 0
% 0.39/0.67  #    Propositional clauses after purity: 0
% 0.39/0.67  #    Propositional unsat core size     : 0
% 0.39/0.67  #    Propositional preprocessing time  : 0.000
% 0.39/0.67  #    Propositional encoding time       : 0.000
% 0.39/0.67  #    Propositional solver time         : 0.000
% 0.39/0.67  #    Success case prop preproc time    : 0.000
% 0.39/0.67  #    Success case prop encoding time   : 0.000
% 0.39/0.67  #    Success case prop solver time     : 0.000
% 0.39/0.67  # Current number of processed clauses  : 47
% 0.39/0.67  #    Positive orientable unit clauses  : 12
% 0.39/0.67  #    Positive unorientable unit clauses: 0
% 0.39/0.67  #    Negative unit clauses             : 16
% 0.39/0.67  #    Non-unit-clauses                  : 19
% 0.39/0.67  # Current number of unprocessed clauses: 224
% 0.39/0.67  # ...number of literals in the above   : 958
% 0.39/0.67  # Current number of archived formulas  : 0
% 0.39/0.67  # Current number of archived clauses   : 270
% 0.39/0.67  # Clause-clause subsumption calls (NU) : 37421
% 0.39/0.67  # Rec. Clause-clause subsumption calls : 4738
% 0.39/0.67  # Non-unit clause-clause subsumptions  : 93
% 0.39/0.67  # Unit Clause-clause subsumption calls : 86
% 0.39/0.67  # Rewrite failures with RHS unbound    : 0
% 0.39/0.67  # BW rewrite match attempts            : 35
% 0.39/0.67  # BW rewrite match successes           : 23
% 0.39/0.67  # Condensation attempts                : 0
% 0.39/0.67  # Condensation successes               : 0
% 0.39/0.67  # Termbank termtop insertions          : 66541
% 0.39/0.67  # Search garbage collected termcells   : 13056
% 0.39/0.67  
% 0.39/0.67  # -------------------------------------------------
% 0.39/0.67  # User time                : 0.081 s
% 0.39/0.67  # System time              : 0.005 s
% 0.39/0.67  # Total time               : 0.086 s
% 0.39/0.67  # Maximum resident set size: 4320 pages
% 0.39/0.67  
% 0.39/0.67  # -------------------------------------------------
% 0.39/0.67  # User time                : 0.090 s
% 0.39/0.67  # System time              : 0.007 s
% 0.39/0.67  # Total time               : 0.098 s
% 0.39/0.67  # Maximum resident set size: 2632 pages
% 0.39/0.67  % E---3.1 exiting
% 0.39/0.67  % E exiting
%------------------------------------------------------------------------------